AntStar: Enhancing Optimization Problems by Integrating an Ant System andA⁎Algorithm
نویسندگان
چکیده
منابع مشابه
the combinatorial ant system for dynamic combinatorial optimization problems
In this paper is presented a distributed algorithm based on Ant System concepts, called Combinatorial Ant System, to solve dynamic combinatorial optimization problems. Our approach consists of mapping the solution space of the dynamic combinatorial optimization problem in the space where the ants will walk, and defining the transition probability and the pheromone update formula of the Ant Syst...
متن کاملSuperior/Inferior Segment-Discriminated Ant System for combinatorial optimization problems
The Ant Colony Optimization method is a heuristic algorithm for solving various optimization problems, particularly the combinatorial optimization problems. Traditional ant-optimization methods might encounter search stagnation owing to a biased pheromone map that is dominated by local optimal trails. To overcome this drawback and lower the number of solution constructions for finding the optim...
متن کاملAnt Colony System Optimization
Successful heuristic algorithms for solving combinatorial optimization problems have mimicked processes observed in nature. Two highly successful families of algorithms that do this are simulated annealing and genetic algorithms. Here, a third family of algorithms, ant colony optimization is explored and implemented in C#. The test bed for evaluating the quality of solutions is based on several...
متن کاملVery Strongly Constrained Problems: an Ant Colony Optimization Approach
Ant Colony Optimization (ACO) is a class of metaheuristic algorithms sharing the common approach of constructing a solution on the basis of information provided both by a standard constructive heuristic and by previously constructed solutions. This paper is composed of three parts. The first one frames ACO in current trends of research on metaheuristics for combinatorial optimization. The secon...
متن کاملAnt Algorithms Solve Difficult Optimization Problems
The ant algorithms research field builds on the idea that the study of the behavior of ant colonies or other social insects is interesting for computer scientists, because it provides models of distributed organization that can be used as a source of inspiration for the design of optimization and distributed control algorithms. In this paper we overview this growing research field, giving parti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Programming
سال: 2016
ISSN: 1058-9244,1875-919X
DOI: 10.1155/2016/5136327